Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem
نویسندگان
چکیده
منابع مشابه
Continuous Reformulations for Zero-one Programming Problems
In this work, we study continuous reformulations of zero–one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero–one programming problem can be obtained by solving a specific continuous problem.
متن کاملThe maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
متن کاملThe Maximum Clique Problem
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v ) ∈ E. Using the notation ES to represent the subset of edges which have both endpoints in clique S, the induced graph GS = ( S, ES ) is complete. Finding the largest clique in a graph is an NP-hard problem, called the maximum clique problem (MCP). Cliques are intimate...
متن کاملSome Optimization Reformulations of the Extended Linear Complementarity Problem
We consider the extended linear complementarity problem (XLCP) introduced by Mangasarian and Pang [22], of which the horizontal and vertical linear complementarity problems are two special cases. We give some new sufficient conditions for every stationary point of the natural bilinear program associated with XLCP to be a solution of XLCP. We further propose some unconstrained and bound constrai...
متن کاملUsing Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a graph. A clique of a graph G = (X, E) is a subset V of X, such that every two nodes in V are joined by an edge of E. The maximum clique problem consists of finding ω(G) the largest cardinality of a clique. We propose two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Pannonica
سال: 2021
ISSN: 0865-2090,2786-0752
DOI: 10.1556/314.2020.00005